A Batch-mode Mapping Algorithm in Highly Heterogeneous Computational Grids using Learning Automata

نویسندگان

  • S. Ghanbari
  • M. R. Meybodi
چکیده

The computational grid is a new paradigm in parallel and distributed computing systems for realizing a virtual supercomputer over idle resources available in a wide area network like the Internet. Computational Grids are characterized for exploiting highly heterogeneous resources; so, one of the main concerns in developing computational grids is how to effectively map tasks onto heterogeneous resources in order to gain high utilization. Two approaches for mapping the tasks exist, online mode and batch mode. In batch-mode at any mapping event, a batch of tasks is mapped, whereas in online mode only one task is mapped. In this paper, two batch-mode algorithms for task mapping based on learning automata are introduced. To show the effectiveness of the proposed algorithms, computer simulations have been conducted. The results of experiments show that the proposed algorithms outperform three best existing mapping algorithms when the heterogeneity of the environment is very high.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On-line Mapping Algorithms in Highly Heterogeneous Computational Grids: A Learning Automata Approach

Computational grid is a new paradigm in parallel and distributed computing systems for realizing a virtual supercomputer over idle resources available in a wide area network like the Internet. Computational Grids are characterized for exploiting highly heterogeneous resources; so, one of the main concerns in developing computational grids is how to effectively map tasks onto heterogeneous resou...

متن کامل

Learning Automata Based Algorithms for Mapping of a Class of Independent Tasks over Highly Heterogeneous Grids

The computational grid provides a platform for exploiting various computational resources over wide area networks. One of the concerns in implementing computational grid environment is how to effectively map tasks onto resources in order to gain high utilization in the highly heterogeneous environment of the grid. In this paper, three algorithms for task mapping based on learning automata are i...

متن کامل

Task Aware Switcher Scheduling for Batch Mode Mapping in Computational Grid Environment

Grid computing is a high performance computing environment which is responsible for solving large-scale computational problems. We can see Computational Grids as a next generation computing which is a collection of heterogeneous computing resources connected by a network across geographically dispersed domains to form a distributed high performance computing environment. In Grid computing one o...

متن کامل

Improved Frog Leaping Algorithm Using Cellular Learning Automata

In this paper, a new algorithm which is the result of the combination of cellular learning automata and frog leap algorithm (SFLA) is proposed for optimization in continuous, static environments.At the proposed algorithm, each memeplex of frogs is placed in a cell of cellular learning automata. Learning automata in each cell acts as the brain of memeplex, and will determine the strategy of moti...

متن کامل

LACAIS: Learning Automata Based Cooperative Artificial Immune System for Function Optimization

Artificial Immune System (AIS) is taken into account from evolutionary algorithms that have been inspired from defensive mechanism of complex natural immune system. For using this algorithm like other evolutionary algorithms, it should be regulated many parameters, which usually they confront researchers with difficulties. Also another weakness of AIS especially in multimodal problems is trappi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004